#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=110;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
double dp[maxn][maxn][maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL r,s,p;cin>>r>>s>>p;
   dp[r][s][p]=1.0;
   double ans1=0;double ans2=0;double ans3=0;
   for(LL i=r;i>=0;i--){
       for(LL j=s;j>=0;j--){
           for(LL k=p;k>=0;k--){
               double tot=i*j+j*k+k*i;
               if(i&&k) dp[i-1][j][k]+=dp[i][j][k]*i*k/tot;
               if(i&&j) dp[i][j-1][k]+=dp[i][j][k]*i*j/tot;
               if(j&&k) dp[i][j][k-1]+=dp[i][j][k]*k*j/tot;
               if(i&&!j&&!k) ans1+=dp[i][j][k];
               if(!i&&j&&!k) ans2+=dp[i][j][k];
               if(!i&&!j&&k) ans3+=dp[i][j][k];
           }
       }
   }
   printf("%.11f  %.11f %.11f\n",ans1,ans2,ans3);
   return 0;
}
